#include <stdio.h>
#include "include/queue.h"

queue_node_t* new_queue_node(int data)
{
    queue_node_t *n  = (queue_node_t *)malloc(sizeof(queue_node_t));
    n->data = data;
    n->next = NULL;
    return n;
}

int queue_push(queue_t *queue, int data)
{
    queue_node_t *n = new_queue_node(data);
    if (queue == NULL)
    {
        queue = (queue_t *)malloc(sizeof(queue_t));
        queue->head = queue->tail = n;
        return 0;
    }

    n->next = queue->head;
    queue->head = n;
    return 0;
}

queue_node_t *queue_pop(queue_t *queue)
{
    queue_node_t *t = queue->tail;
    

}